Exact solution to an interacting extreme-value problem: The pure-flaw model
نویسندگان
چکیده
منابع مشابه
A Pragmatic Solution to the Value Problem of Knowledge
We value possessing knowledge more than true belief. Both someone with knowledge and someone with a true belief possess the correct answer to a question. Why is knowledge more valuable than true belief if both contain the correct answer? I examine the philosophy of American pragmatist John Dewey and then I offer a novel solution to this question often called the value problem of knowledge. I pr...
متن کاملInteracting dimers on the honeycomb lattice: an exact solution of the five-vertex model
The problem of close-packed dimers on the honeycomb lattice was solved by Kasteleyn in 1963. Here we extend the solution to include interactions between neighboring dimers in two spatial lattice directions. The solution is obtained by using the method of Bethe ansatz and by converting the dimer problem into a five-vertex problem. The complete phase diagram is obtained and it is found that a new...
متن کاملLeast order, stable solution of the exact model matching problem
-The set of all solutions of the minimal design problem (MDP) is presented in parametric form. This result is obtained by first deriving a parametric representation of all minimal bases of a particular vector space.From this the set of all solutions of the MDP are obtained. Then conditipns are placed on the. parameters, which conditions define set of stable solutions of the MDP. Solutions to th...
متن کاملAn Exact Solution Approach for the Airport Stand Allocation Problem
Every day planners and dispatcher in airports deal with different decisions related to the movement of aircraft. These decisions usually involve the use of fixed resources like runways, stands (parking positions), and passenger gates. Due to the increasing flow of passengers, these resources are becoming scarce and some airports have experimented a degradation of the services offered. One clear...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Institute of Standards and Technology
سال: 1994
ISSN: 1044-677X
DOI: 10.6028/jres.099.031